Profit aAlocation Problems for Fourth Party Logistics Supply Chain Coalition Based on Game Theory Approach

Aim/purpose - The paper analyses how game theory can be exploited to provide the implementation of profit allocations among the members of the fourth party logistics supply chain coalition system. Design/methodology/approach - The study compares four allocation rules from cooperative game theory in order to explore fair and reasonable sharing of revenue among the partners in the venture. Findings - As a result, more practical situations can be modelled and more supply chain efficiency can be obtained throughout the several steps carried out by decision makers. Our computational analysis establishes that the proposed methods are computationally efficient and can be implemented to solve real-life problems. Research implications/limitations - Our business process simulation of the 4PL supply chain coalition including a simulation of the profit allocation concept allowed us to develop a broad understanding of the management process of the 4PL supply chain coalition approach. Originality/value/contribution - A comparison of the different methods based on game theory provided an opportunity for reaching the prefect collaboration. These views enrich our understanding of the 4PL supply chain coalition and help us to implement an innovative development for the sector.(original abstract

Linearly-invariant families and generalized Meixner–Pollaczek polynomials

The extremal functions  $f_0(z)$  realizing the maxima of some functionals (e.g. $\max|a_3|$, and  $\max{arg f^{'}(z)}$) within the so-called universal linearly invariant family $U_\alpha$ (in the sense of Pommerenke [10]) have such a form that $f_0^{'}(z)$  looks similar to generating function for Meixner-Pollaczek (MP) polynomials [2], [8]. This fact gives motivation for the definition and study of the generalized Meixner-Pollaczek (GMP) polynomials $P_n^\lambda(x;\theta,\psi)$ of a real variable $x$ as coefficients of G^\lambda(x;\theta,\psi;z)=\frac{1}{(1-ze^{i\theta})^{\lambda-ix}(1-ze^{i\psi})^{\lambda+ix}}=\sum_{n=0}^\infty P_n^\lambda (x;\theta,\psi)z^n,\ |z|<1, where the parameters $\lambda$, $\theta$, $\psi$ satisfy the conditions: \lambda > 0, $\theta \in (0,\pi)$, $\psi \in \mathbb{R}$. In the case $\psi=-\theta$ we have the well-known (MP) polynomials. The cases $\psi=\pi-\theta$ and $\psi=\pi+\theta$ leads to new sets of polynomials which we call quasi-Meixner-Pollaczek polynomials and strongly symmetric Meixner-Pollaczek polynomials. If  $x=0$,  then we have an obvious generalization of the Gegenbauer polynomials.The properties of (GMP) polynomials as well as of some families of holomorphic functions  |z|<1  defined by the Stieltjes-integral formula, where the function  $zG^{\lambda}(x; \theta, \psi;z)$ is a kernel, will be discussed

An extension of typically-real functions and associated orthogonal polynomials

Two-parameters extension of the family of typically-real functions is studied. The definition is obtained by the Stjeltjes integral formula. The kernel function in this definition serves as a generating function for some family of orthogonal polynomials generalizing Chebyshev polynomials of the second kind. The results of this paper concern the exact region of local univalence, bounds for the radius of univalence, the coefficient problems within the considered family as well as the basic properties of obtained orthogonal polynomials

Optimized eight-dimensional lattice modulation format for IM-DD 56 Gb/s optical interconnections using 850 nm VCSELs

In this paper a novel eight-dimensional lattice optimized modulation format, Block Based 8-dimensional/8-level (BB8), is proposed, taking into account the tradeoff between high performance and modulation simplicity. We provide an experimental performance comparison with its n-level pulse amplitude modulation counterparts in a 28 GBd 850-nm vertical-cavity surface-emitting laser based intensity-modulation direct-detection system. Successful data transmission over 100 m multimode fiber links of OM3 and OM4 types is demonstrated, with a power margin close to 2 dB at 100GBASE-SR4 forward error correction threshold. A simplified bit-to-symbol mapping and corresponding symbol-to-bit demapping algorithms, together with a hyperspace hard-decision, are designed specifically for applications of short-reach data links. These algorithms are expected to use affordable computational resources with relatively low latency

Optical-domain Compensation for Coupling between Optical Fiber Conjugate Vortex Modes

We demonstrate for the first time optical-domain compensation for coupling between conjugate vortex modes in optical fibers. We introduce a novel method for reconstructing the complex propagation matrix of the optical fiber with straightforward implementation

コンピューターシミュレーションによるポリグルタミンペプチドの特性解析

ポリグルタミン病の原因となるポリグルタミンペプチドの動態を計算機シミュレーションによって解析し、病気発症のきっかけとなるたんぱく質凝集過程について物理化学的側面から合理的な説明を与えた。博士（理学）神戸大